Locational analysis for regionalization of Turkish Red Crescent blood services

After a series of earthquakes in 1999, Turkish Red Crescent (TRC) has engaged in a restructuring for all of its activities, including the blood services. Our study on the blood management system had been started as part of this initiative to restructure the blood services and improve both their effectiveness and efficiency. In the current system of TRC, not much consideration has been given to how the locational decisions affect the performance of blood centers, stations and mobile units. In recent years, however, there has been much discussion regarding the regionalization of the blood management system in Turkey. In this study, we develop several mathematical models to solve the location–allocation decision problems in regionalization of blood services. We report our computational results, obtained by using real data, for TRC blood services.     

Fast parallel Preconditioned Conjugate Gradient algorithms for robot manipulator dynamics simulation

In this paper fast parallel Preconditioned Conjugate Gradient (PCG) algorithms for robot manipulator forward dynamics, or dynamic simulation, problem are presented. By exploiting the inherent structure of the forward dynamics problem, suitable preconditioners are devised to accelerate the iterations. Also, based on the choice of preconditioners, a modified dynamic formulation is used to speedup both serial and parallel computation of each iteration. The implementation of the parallel algorithms on two interconnected processor arrays is discussed and their computation and communication complexities are analyzed. The simulation results for a Puma Arm are presented to illustrate the effectiveness of the proposed preconditioners. With a faster convergence due to preconditioning and a faster computation of iterations due to parallelization, the developed parallel PCG algorithms represent the fastest alternative for parallel computation of the problem withO(n) processors.     

External watchman routes

We consider the problem of finding a shortest watchman route from which the exterior of a polygon is visible (external watchman route). We present an O (n ⁴ log logn) algorithm to find shortest external watchman routes for simple polygons by transforming the external watchman route problem to a set of internal watchman route problems. Also, we present faster external watchman route algorithms for special cases. These include optimal O (n) algorithms for convex, monotone, star and spiral polygons and an O (n log logn) algorithm for rectilinear polygons.This work was supported in part by a grant from Texas Instruments, Inc. to S. Ntafos     

层次式级联多网络模型及其性能

本文提出了一种层次式级联多网络结构，论述了其训练算法，并验证了该结构的收敛性。这种结构在处理高阶非线性分布数据的分类问题方面具有优良的性能，用北京谱仪事例过滤进行性能测试结果表明，其训练和泛化性能都优于单个ＢＰ网络。     

制丝线加香加料系统的问题及改进方法

针对目前卷烟企业制丝线加香、加料系统普遍存在的问题,从设备选型、控制算法进行分析,提出改进方法。     

计算机网络信息管理及其安全防护策略

文章以计算机网络信息管理工作为研究对象,从计算机网络信息管理内容的分类、计算机网络信息管理工作中的安全问题分析以及计算机网络信息安全防护策略分析这三个方面入手,对其进行了较为详细的分析与阐述,并据此论证了做好这一工作在进一步提升计算机网络信息管理质量与管理效率的过程中所起到的至关重要的作用与意义。     

带平衡约束矩形布局优化问题的深度强化学习算法

带平衡约束的矩形布局问题源于卫星舱设备布局设计,属于组合优化问题。深度强化学习利用奖赏机制,通过数据训练实现高性能决策优化。针对布局优化问题,提出一种基于深度强化学习的新算法DAR及其扩展算法IDAR。DAR用指针网络输出定位顺序,再利用定位机制给出布局结果,算法的时间复杂度是O（n³）;IDAR算法在DAR的基础上引入迭代机制,算法时间复杂度是O（n⁴）,但能给出更好的结果。测试表明DAR算法具有较好的学习能力,用小型布局问题进行求解训练所获得的模型,能有效应用在大型问题上。在两个大规模典型算例的对照实验中,提出算法分别超出和接近目前最优解,具有时间和质量上的优势。     

电力工程中的地质灾害危险性评估

我国幅员辽阔,地质环境条件多样且复杂,导致了地质灾害发育强烈,种类繁多、危害较大。地质灾害与工程建设活动密切相关,既相互作用,相互依存,又相互影响[1]。电力工程项目遍布全国,特别是输电线路大多为人烟稀少的山区分布,线路长,跨越的地质地貌区域复杂,存在的地质灾害多种多样,或多或少面临着各种地质灾害的严重威胁[2]。通过电力工程地质灾害危险性评估工作的现状及评估工作流程的介绍,进一步分析电力工程地质灾害的危险性评估工作中存在的问题并提出了相应的看法。     

An implicit enthalpy scheme for one-phase Stefan problems

A compact finite-difference scheme to solve one-phase Stefan problems in one dimension is described. Numerical experiments indicate that the moving interface is obtained withO(t) accuracy when 3–4 iterations per time step are used to solve the nonlinear implicit scheme. The scheme can be adapted to ADI methods in higher dimensions.     

结构化对等网络特性及关键技术分析

本文简述了对等网络的概念及分类,分析了结构化对等网络特性、存在问题和关键技术,指出结构化对等网络的发展前景。